Counting Binary Words Avoiding Alternating Patterns
نویسندگان
چکیده
Let F [p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F [p].
منابع مشابه
Generation of binary words avoiding alternating patterns
In this paper we propose an algorithm to generate binary words with no more 0’s than 1’s having a fixed number of 1’s and avoiding the pattern (10)1 for any fixed j ≥ 1. We will prove that this generation is exhaustive, that is, all such binary words are generated.
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملAlternating, Pattern-Avoiding Permutations
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set Sn(132) of 132-avoiding permutations and the set A2n+1(132) of alternating, 132avoiding permutations. For every set p1, . . . , pk of patterns and certain related patterns q1, . . . , qk, our bijection restricts to a bijection between Sn(...
متن کاملEnumeration Schemes for Words Avoiding Patterns with Repeated Letters
In this paper, we discuss the enumeration of words avoiding patterns with repeated letters. More specifically, we find recurrences (i.e. enumeration schemes) counting words avoiding any pattern of length 3 and words avoiding any monotone pattern.
متن کاملPattern avoidance in binary trees
This paper introduces the notion of pattern avoidance in binary trees. We provide an algorithm for computing the generating function that counts the number of n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective trees that avoid them are equinumerou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013